Dorit S. Hochbaum: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

1

A Polynomial Algorithm for the k-cut Problem for Fixed k

Goldschmidt, Olivier, Hochbaum, Dorit S.

Journal:

Mathematics of Operations Research

Year:

1994

Language:

english

File:

PDF, 762 KB

english, 1994

2

Minimax problems with bitonic matrices

Dorit S. Hochbaum, Paul A. Tucker

Journal:

Year:

2002

Language:

english

File:

PDF, 192 KB

english, 2002

3

Solving the Convex Cost Integer Dual Network Flow Problem

Ahuja, Ravindra K., Hochbaum, Dorit S., Orlin, James B.

Journal:

Management Science

Year:

2003

Language:

english

File:

PDF, 237 KB

english, 2003

4

Rating Customers According to Their Promptness to Adopt New Products

Hochbaum, Dorit S., Moreno-Centeno, Erick, Yelland, Phillip, Catena, Rodolfo A.

Journal:

Operations Research

Year:

2011

Language:

english

File:

PDF, 448 KB

english, 2011

5

A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem

Chandran, Bala G., Hochbaum, Dorit S.

Journal:

Operations Research

Year:

2009

Language:

english

File:

PDF, 294 KB

english, 2009

6

The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem

Hochbaum, Dorit S., Rao, Xu

Journal:

Operations Research

Year:

2019

Language:

english

File:

PDF, 1.15 MB

english, 2019

7

A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant

Hochbaum, Dorit S.

Journal:

Operations Research

Year:

2013

Language:

english

File:

PDF, 1.88 MB

english, 2013

8

Methodologies and Algorithms for Group-Rankings Decision

Hochbaum, Dorit S., Levin, Asaf

Journal:

Management Science

Year:

2006

Language:

english

File:

PDF, 241 KB

english, 2006

9

Fast approximation algorithms for a nonconvex covering problem

Dorit S Hochbaum, Wolfgang Maass

Journal:

Journal of Algorithms

Year:

1987

Language:

english

File:

PDF, 1.14 MB

english, 1987

10

Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today

Dorit S. Hochbaum

Journal:

Management Science

Year:

2004

Language:

english

File:

PDF, 3.10 MB

english, 2004

11

A Packing Problem You Can Almost Solve by Sitting on Your Suitcase

Hochbaum, Dorit S., Shmoys, David B.

Journal:

SIAM Journal on Algebraic and Discrete Methods

Year:

1986

Language:

english

File:

PDF, 1.20 MB

english, 1986

12

A new—old algorithm for minimum-cut and maximum-flow in closure graphs

Dorit S. Hochbaum

Journal:

Year:

2001

Language:

english

File:

PDF, 307 KB

english, 2001

13

Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem

Hochbaum, Dorit S., Chen, Anna

Journal:

Operations Research

Year:

2000

Language:

english

File:

PDF, 315 KB

english, 2000

14

Country credit-risk rating aggregation via the separation-deviation model†

Hochbaum, Dorit S., Moreno-Centeno, Erick

Journal:

Optimization Methods and Software

Year:

2008

Language:

english

File:

PDF, 135 KB

english, 2008

15

Erratum: A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems

Hochbaum, Dorit S., Lu, Cheng

Journal:

SIAM Journal on Optimization

Year:

2020

Language:

english

File:

PDF, 148 KB

english, 2020

16

A Best Possible Heuristic for the k -Center Problem

Hochbaum, Dorit S., Shmoys, David B.

Journal:

Mathematics of Operations Research

Year:

1985

Language:

english

File:

PDF, 366 KB

english, 1985

17

Database Location in Computer Networks

Fisher, Marshall L., Hochbaum, Dorit S.

Journal:

Journal of the ACM

Year:

1980

Language:

english

File:

PDF, 938 KB

english, 1980

18

50th Anniversary Article: Selection, Provisioning, Shared Fixed Costs, Maximum Closure, and Implications on Algorithmic Methods Today

Hochbaum, Dorit S.

Journal:

Management Science

Year:

2004

Language:

english

File:

PDF, 278 KB

english, 2004

19

Capacity Acquisition, Subcontracting, and Lot Sizing

Atamtürk, Alper, Hochbaum, Dorit S.

Journal:

Management Science

Year:

2001

Language:

english

File:

PDF, 369 KB

english, 2001

20

Efficient Algorithms for the Inverse Spanning-Tree Problem

Dorit S. Hochbaum

Journal:

Operations Research

Year:

2003

Language:

english

File:

PDF, 691 KB

english, 2003

21

The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem

Hochbaum, Dorit S.

Journal:

Operations Research

Year:

2008

Language:

english

File:

PDF, 307 KB

english, 2008

22

[Lecture Notes in Computer Science] Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques Volume 1671 || A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

Hochbaum, Dorit S., Jansen, Klaus, Rolim, José D. P., Sinclair, Alistair

Year:

1999

Language:

english

File:

PDF, 262 KB

english, 1999

23

The bottleneck graph partition problem

Hochbaum, Dorit S., Pathria, Anu

Journal:

Year:

1996

Language:

english

File:

PDF, 401 KB

english, 1996

24

Analysis of the greedy approach in problems of maximum k-coverage

Dorit S. Hochbaum, Anu Pathria

Journal:

Naval Research Logistics (NRL)

Year:

1998

Language:

english

File:

PDF, 92 KB

english, 1998

25

Approximation Algorithms for the Set Covering and Vertex Cover Problems

Hochbaum, Dorit S.

Journal:

SIAM Journal on Computing

Year:

1982

Language:

english

File:

PDF, 259 KB

english, 1982

26

Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem

Dorit S. Hochbaum and Ron Shamir

Journal:

Operations Research

Year:

1991

Language:

english

File:

PDF, 1.11 MB

english, 1991

27

Analysis of a flow problem with fixed charges

Dorit S. Hochbaum, Arie Segev

Journal:

Year:

1989

Language:

english

File:

PDF, 1007 KB

english, 1989

28

Solving the Convex Cost Integer Dual Network Flow Problem

Ravindra K. Ahuja, Dorit S. Hochbaum and James B. Orlin

Journal:

Management Science

Year:

2003

Language:

english

File:

PDF, 683 KB

english, 2003

29

Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time

Ravindra K. Ahuja and Dorit S. Hochbaum

Journal:

Operations Research

Year:

2008

Language:

english

File:

PDF, 1.32 MB

english, 2008

30

A quantitative analysis of astigmatism induced by pterygium

Dorit R. Hochbaum, Samuel E. Moskowitz, Jonathan D. Wirtschafter

Journal:

Journal of Biomechanics

Year:

1977

Language:

english

File:

PDF, 1.16 MB

english, 1977

31

Baseball, Optimization, and the World Wide Web

Adler, Ilan, Erera, Alan L., Hochbaum, Dorit S., Olinick, Eli V.

Journal:

Year:

2002

Language:

english

File:

PDF, 170 KB

english, 2002

32

Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems

Hochbaum, Dorit S.

Journal:

Mathematics of Operations Research

Year:

1994

Language:

english

File:

PDF, 1.14 MB

english, 1994

33

On the Complexity of the Production-Transportation Problem

Hochbaum, Dorit S., Hong, Sung-Pil

Journal:

SIAM Journal on Optimization

Year:

1996

Language:

english

File:

PDF, 1.47 MB

english, 1996

34

A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem

Bala G. Chandran and Dorit S. Hochbaum

Journal:

Operations Research

Year:

2009

Language:

english

File:

PDF, 2.11 MB

english, 2009

35

Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems

Dorit S. Hochbaum

Journal:

Mathematics of Operations Research

Year:

1994

Language:

english

File:

PDF, 821 KB

english, 1994

36

Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem

Dorit S. Hochbaum and Anna Chen

Journal:

Operations Research

Year:

2000

Language:

english

File:

PDF, 787 KB

english, 2000

37

Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime

Dorit S. Hochbaum and Dan Landy

Journal:

Operations Research

Year:

1997

Language:

english

File:

PDF, 470 KB

english, 1997

38

A polynomial time repeated cuts algorithm for the time cost tradeoff problem: The linear and convex crashing cost deadline problem

Hochbaum, Dorit S.

Journal:

Computers & Industrial Engineering

Year:

2016

Language:

english

File:

PDF, 529 KB

english, 2016

39

Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality

Dorit S. Hochbaum, Nimrod Megiddo, Joseph (Seffi) Naor, Arie Tamir

Journal:

Mathematical Programming

Year:

1993

Language:

english

File:

PDF, 991 KB

english, 1993

40

Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem

Dorit S. Hochbaum, David B. Shmoys

Journal:

European Journal of Operational Research

Year:

1986

Language:

english

File:

PDF, 409 KB

english, 1986

41

Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources

Cosares, Steven, Hochbaum, Dorit S.

Journal:

Mathematics of Operations Research

Year:

1994

Language:

english

File:

PDF, 977 KB

english, 1994

42

Approximating a generalization of MAX 2SAT and MIN 2SAT

Dorit S. Hochbaum, Anu Pathria

Journal:

Discrete Applied Mathematics

Year:

2000

Language:

english

File:

PDF, 142 KB

english, 2000

43

A polynomial algorithm for an integer quadratic non-separable transportation problem

Dorit S. Hochbaum, Ron Shamir, J. George Shanthikumar

Journal:

Mathematical Programming

Year:

1992

Language:

english

File:

PDF, 728 KB

english, 1992

44

Heuristics for the fixed cost median problem

Dorit S. Hochbaum

Journal:

Mathematical Programming

Year:

1982

Language:

english

File:

PDF, 658 KB

english, 1982

45

An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem

Hochbaum, Dorit S., Shmoys, David B.

Journal:

SIAM Journal on Algebraic and Discrete Methods

Year:

1985

Language:

english

File:

PDF, 676 KB

english, 1985

46

[IEEE 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) - Portland, OR, USA (1985.10.21-1985.10.23)] 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) - Using dual approximation algorithms for scheduling problems: Theoretical and practical results

Hochbaum, Dorit S., Shmoys, David B.

Year:

1985

Language:

english

File:

PDF, 1.43 MB

english, 1985

47

Security routing games with multivehicle Chinese postman problem

Hochbaum, Dorit S., Lyu, Cheng, Ordóñez, Fernando

Journal:

Year:

2014

Language:

english

File:

PDF, 353 KB

english, 2014

48

Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem

Hochbaum, Dorit S., Shamir, Ron

Journal:

Operations Research

Year:

1991

Language:

english

File:

PDF, 500 KB

english, 1991

49

An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs

Dorit S. Hochbaum

Journal:

Operations Research

Year:

1992

Language:

english

File:

PDF, 656 KB

english, 1992

50

Algorithms and complexity of range clustering

Hochbaum, Dorit S.

Journal:

Year:

2018

Language:

english

File:

PDF, 1.35 MB

english, 2018

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@1delivery.pm

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски